Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
نویسندگان
چکیده
In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [23] are modelled in a generalized setting with set functors. Further, we show how partially ordered monads can be used in order to obtain monad based examples of Kleene algebras building upon a wide range of set functors far beyond just strings [19] and relations [27].
منابع مشابه
Partially ordered monads and powerset Kleene algebras
Monads are used for various applications in computer science, and well-known is e.g. the interpretation of morphisms in the Kleisli category of the term monad as variable substitutions assigning variables to terms. An application building upon this observation is the equivalence between most general unifiers and co-equalizers in this category [13]. In this paper we will use monads with addition...
متن کاملIndependence-friendly cylindric set algebras
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of ...
متن کاملRepresenting regular Kleene algebras by tolerance-based rough sets
We show that any regular Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra defined by a tolerance induced by an irredundant covering.
متن کاملKleene Monads: Handling Iteration in a Framework of Generic Effects
Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of effects for short, which made its way into modern functional programming in the shape of Haskell’s do-notation. Standard computational idioms call for specific classes of monads that support additional control operations. Here, w...
متن کاملFixed point theorems for $alpha$-$psi$-contractive mappings in partially ordered sets and application to ordinary differential equations
In this paper, we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 225 شماره
صفحات -
تاریخ انتشار 2009